Top-down decision tree learning as information based boosting
نویسندگان
چکیده
منابع مشابه
On the boosting ability of top-down decision tree learning algorithm for multiclass classification
We analyze the performance of the top-down multiclass classification algorithm for decision tree learning called LOMtree, recently proposed in the literature Choromanska and Langford (2014) for solving efficiently classification problems with very large number of classes. The algorithm online optimizes the objective function which simultaneously controls the depth of the tree and its statistica...
متن کاملLearning Top-Down Tree Transducers with Regular Domain Inspection
We study the problem of how to learn tree transformations on a given regular tree domain from a finite sample of input-output examples. We assume that the target tree transformation can be defined by a deterministic top-down tree transducer with regular domain inspection (DTopIreg). An rpni style learning algorithm that solves this problem in polynomial time and with polynomially many examples ...
متن کاملTop-Down Tree-To-Graph Transducers
We introduce a new syntax-directed translation device called top-down treeto-graph transducer. Such transducers are very similar to the usual top-down tree trans ducers except that the right-hand sides of their rules are hypergraphs rather than trees. Since we are aiming at a device which also allows to translate trees into objects ditTerent from graphs, we focus our attention on so-called tree...
متن کاملSCENARIO-BASED EVALUATION OF ENTERPRISE ARCHITECTURE A top-down approach for chief information officer decision making
As the primary stakeholder for the Enterprise Architecture, the Chief Information Officer (CIO) is responsible for the evolution of the enterprise IT system. An important part of the CIO role is therefore to make decisions about strategic and complex IT matters. This paper presents a cost effective and scenariobased approach for providing the CIO with an accurate basis for decision making. Scen...
متن کاملTypechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input schema. As typechecking quickly turns undecidable for query languages capable of testing equality of data values, we return to the limited framework where we abstract XML documents as labeled ordered trees. We focus on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00181-0